Search results for "Bottleneck traveling salesman problem"
showing 1 items of 1 documents
NP-completeness of the hamming salesman problem
1985
It is shown that the traveling salesman problem, where cities are bit strings with Hamming distances, is NP-complete.